Tree Book indexing

[lawrenceserrano]

anyone can help me guys, i am a newby here and need some help about the code and program...

Desired Output;Index pages of a book
Functionalities:
-add major or minor term
-add pages to a major term
-add minor terms to a major term
-add pages to a minor term
-sort pages in ascending order
-Display output


example:
array 8, 10-15
binary search- 12
sequentil search 10
size 8
linked list 35
array implementations 36, 39
pointer implementation 39, 115, 207
start 35
queue allocation 201, 200

[AndiPersti]

How much do you pay? :-)

Seriously, read How To Ask Questions The Smart Way

Bye, Andreas

[lawrenceserrano]

nevermind andreas... im just hoping there is someone will help me. thanks for the links... God bless you.. ^_^

[AndiPersti]

Nobody will be able to help you if you don't show what you have already done and where you are stuck (errors, unexpected output, ...).

Bye, Andreas

[qny]

I'll help you start

int main(int argc, char **argv) {
}

[Adak]

I can see how you could do this, EXCEPT, for the multi-word terms (entries), for the index. "Queue" would be easy, but "queue allocation" is a problem. How would your program know that "allocation" should be matched up with "queue"? How would the program know that "pointer arithmetic" would make a good entry, but "arithmetic" by itself, wouldn't?

If you say "because it's the word adjacent to "queue" or to "pointer", then you can add words to the terms, right, left, and center, and make a very stupid index.

It seems to imply that some knowledge of keywords (perhaps in a data file), appropriate to the subject, would be essential.

The rest of it seems pretty straight forward, depending on the depth of the index you wanted to create.

That seems like an assignment for an experienced programmer (no offense). Who (the hell), gave you this job or assignment? I don't know what your programming skills are, but this seems like a very advanced request for a beginner to take on.